Hazard Rate Scaling for the GI/M/n + GI Queue

نویسندگان

  • Josh Reed
  • Tolga Tezcan
چکیده

We obtain a heavy-traffic limit for the GI/M/n+GI queue which includes the entire abandonment distribution. Our main approach is to scale the hazard rate function in an appropriate way such that our resulting diffusion approximation contains the entire hazard rate function. We then show through numerical studies that for various key performance measures, our approximations outperform those commonly used in practice which only involved the abandonment distribution through the value of its density at the origin. The robustness of our results is also demonstrated by applying them to solving constraint satisfaction problems arising in the context of telephone call centers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Bounds for Perturbing Nonexponential Queues

A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...

متن کامل

Approximations for the M/GI/N+GI type call center

In this study, we propose approximations to compute the steady-state performance measures of the M/GI/N + GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1 + GI queue for which we suggest a practical way to compute the waiting time distributions and their moments. T...

متن کامل

Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic

We study a single-server queue, operating under the first-in-first-out (FIFO) service discipline, in which each customer independently abandons the queue if his service has not begun within a generally distributed amount of time. Under some mild conditions on the abandonment distribution, we identify a limiting heavy-traffic regime in which the resulting diffusion approximation for both the off...

متن کامل

Queues with Many Servers and Impatient Customers

The asymptotic many-server queue with abandonments, G/GI/N +GI , is considered in the qualityand efficiency-driven (QED) regime. Here the number of servers and the offered load are related via the square-root rule, as the number of servers increases indefinitely. QED performance entails short waiting times and scarce abandonments (high quality) jointly with high servers’ utilization (high effic...

متن کامل

The Generalized Drift Skorokhod Problem in One Dimension: Its solution and application to the GI/GI/1 +GI and M/M/N/N transient distributions

We show how to write the solution to the generalized drift Skorokhod problem in onedimension in terms of the supremum of the solution of an unrestricted integral equation (that is, an integral equation with no boundaries). As an application of our result, we equate the transient distribution of a reflected Ornstein-Uhlenbeck (O-U) process to the first hitting time distribution of an O-U process...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009